Path Planning among Movable Obstacles: A Probabilistically Complete Approach
نویسندگان
چکیده
In this paper we study the problem of path planning among movable obstacles, in which a robot is allowed to move the obstacles if they block the robot’s way from a start to a goal position. We make the observation that we can decouple the computations of the robot motions and the obstacle movements, and present a probabilistically complete algorithm, something which to date has not been achieved for this problem. Our algorithm maintains an explicit representation of the robot’s configuration space. We present an efficient implementation for the case of planar, axis-aligned environments and report experimental results on challenging scenarios.
منابع مشابه
An Effective Framework for Path Planning Amidst Movable Obstacles
This paper addresses the problem of navigating an autonomous moving entity in an environment with both stationary and movable obstacles. If a movable obstacle blocks the path of the entity attempting to reach its goal configuration, the entity is allowed to alter the placement of the obstacle by manipulation (e.g. pushing or pulling), to clear its path. This paper presents a probabilistically c...
متن کاملHeuristic Motion Planning with Movable Obstacles
We present a heuristic approach to geometric path planning with movable obstacles. Treating movable obstacles as mobile robots leads to path planing problems with many degrees of freedom which are intractable. Our strategy avoids this computational complexity by decoupling the whole motion planning problem into a series of tractable problems, which are solved using known path planning algorithm...
متن کاملPlanning Among Movable Obstacles with Artificial Constraints
In this paper we present artificial constraints as a method for guiding heuristic search in the computationally challenging domain of motion planning among movable obstacles. The robot is permitted to manipulate unspecified obstacles in order to create space for a path. A plan is an ordered sequence of paths for robot motion and object manipulation. We show that under monotone assumptions, anti...
متن کاملAn Evolutionary Navigator for Autonomous Agents on Unknown Large-Scale Environments
— Computation of a collisionfree path for a movable object among obstacles is an important problem in the fields of robotics. In previous research we have introduced an evolutionary algorithm for a robot moving on a known map considering a 4connected grid model, and we have obtained encouraging results. In this paper, we focus our attention on a more complex motion planning problem: An autono...
متن کاملNavigation Among Movable Obstacles
Navigation Among Movable Obstacles Mike Stilman Robots would be much more useful if they could move obstacles out of the way. Traditional motion planning searches for collision free paths from a start to a goal. However, real world search and rescue, construction, home and nursing home domains contain debris, materials clutter, doors and objects that need to be moved by the robot. Theoretically...
متن کامل